RUG: Regular Unification Grammar
نویسنده
چکیده
The paper describes a new unification based grammar formalism called Regula r Unif icat ion G r a m m a r (RUG). The formalism is under development at the Research Unit of Computational Linguistics, University of Helsinki, In outline, RUG can be described as a combination of an extended graph unification formalism with a fixed minimal finite state syntax. Section I of the paper outlines the RUG formalism. Section II describes some aspects of its current implementation. Section III describes an experimental RUG grammar for Finnish.
منابع مشابه
Feature Unification in TAG Derivation Trees
The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from feature based tree adjoining grammars into this new formalism. The translation preserves the derivation structures of the original grammar, and accounts for feat...
متن کاملGenerating referring expressions with a unification grammar
A simple formalism is proposed to represent the contexts in which pronouns, definite/indefinite descriptions, and ordinal descriptions (e.g. 'the second book') can be used, and the way in which these expressions change the context. It is shown that referring expressions can be generated by a unification grammar provided that some phrase-structure rules are specially tailored to express entities...
متن کاملSolving Proportional Analogies by Application of Anti-Unification modulo Equational Theory
This thesis applies the theory of Anti-Unification modulo Equational Theory (E-Anti-Unification, E-Generalization) to proportional analogies in the string domain. Human solving of proportional analogies of the form A : B :: C : D (read: A is to B like C to D, where A,B and C are given) is modelled by an approach originally developed by Heinz [1996], refined in Burghardt [2005]. The goal is to g...
متن کاملA Feature Structure Algebra for FTAG
FTAG, the extension of TAG with feature structures, lags behind other featurebased grammar formalisms in the availability of efficient chart parsers. This is in part because of the complex interaction of adjunction and unification, which makes such parsers inconvenient to implement. We present a novel, simple algebra for feature structures and show how FTAG can be encoded as an Interpreted Regu...
متن کاملA Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars
Tree languages are powerful tools for the representation and schematization of infinite sets of terms for various purposes (unification theory, verification and specification ...). In order to extend the regular tree language framework, more complex formalisms have been developed. In this paper, we focus on Tree Synchronized Grammars and Primal Grammars which introduce specific control structur...
متن کامل